#include<queue>
#include<vector>
#include<iostream>
using namespace std;

priority_queue<int, vector<int>, greater<int> > pq;

int main()
{
	int n, x;
	cin>>n;
	for(int i = 0;i <= n;i++)
	{
		cin>>x;
		pq.push(x);
	}
	while(!pq.empty())
	{
		cout<<pq.top()<<" ";
		pq.pop();
	}
}
